1038C - Gambling - CodeForces Solution

from math import *

def __main__():
        n = int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    a.append(0)
    b.append(0)
    a.sort(reverse=True)
    b.sort(reverse=True)
    i = 0
    j = 0
    asum = 0
    bsum = 0
    step = 0
        while(len(a) > i and len(b) > j):
        if(step % 2 == 0):
            if(a[i] >= b[j]):
                asum += a[i]
                i += 1
            else:
                j += 1
        else:
            if (b[j] >= a[i]):
                bsum += b[j]
                j += 1
            else:
                i += 1
        step += 1
    while(i < len(a)):
        asum += a[i]
        i += 1
    while (j < len(b)):
        bsum += b[j]
        j += 1
    print(asum - bsum)

__main__()